An elementary proof of Euler's formula using Cauchy's method

نویسندگان

چکیده

The use of Cauchy's method to prove Euler's well-known formula is an object many controversies. purpose this paper that applies for convex polyhedra and not only them, but also surfaces such as the torus, projective plane, Klein bottle pinched torus.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Elementary Proof of the Hook Formula

The hook-length formula is a well known result expressing the number of standard tableaux of shape λ in terms of the lengths of the hooks in the diagram of λ. Many proofs of this fact have been given, of varying complexity. We present here an elementary new proof which uses nothing more than the fundamental theorem of algebra. This proof was suggested by a q, t-analog of the hook formula given ...

متن کامل

An Elementary Proof of Euler's Formula for ζ(2m)

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

متن کامل

An Elementary Proof of the Wallis Product Formula for pi

by repeated partial integration. The topic is usually reserved for more advanced calculus courses. The purpose of this note is to show that (1) can be derived using only the mathematics taught in elementary school, that is, basic algebra, the Pythagorean theorem, and the formula π · r 2 for the area of a circle of radius r . Viggo Brun gives an account of Wallis’s method in [1] (in Norwegian). ...

متن کامل

Elementary proof of Rayleigh formula for graphs SVOČ 2007

The Rayleigh monotonicity is a principle from the theory of electrical networks. Its combinatorial interpretation says for each two edges of a graph G, that the presence of one of them in a random spanning tree of G is negatively correlated with the presence of the other edge. In this paper we give a self-contained (inductive) proof of Rayleigh monotonicity for graphs. Rayleigh monotonicity ref...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2021

ISSN: ['1879-3207', '0166-8641']

DOI: https://doi.org/10.1016/j.topol.2020.107558